Formal Verification of Hybrid Byzantine Agreement Under Link Faults

نویسنده

  • John Rushby
چکیده

We describe an extended fault model for Byzantine Agreement due to Schmid and Weiss. The new fault model extends the previous “hybrid” fault model of Thambidurai and Park by the addition of omission-faulty nodes, and by the introduction of link faults. We formally verify the Hybrid Oral Messages Algorithm (OMH) under this new fault model. Our formal verification improves the analysis of Schmid and Weiss a little by increasing the independence of node and link faults, and by making explicit the exact assumptions required in final rounds and in the case OMH(0). We also refute a conjecture of Schmid and Weiss that the analysis can be extended to omission-faulty receivers and introduce a symmetric version of the algorithm that does handle these cases correctly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Verification of Leaders Agreement in the Intrusion-Tolerant Enclaves Using PVS

Enclaves is a group-oriented intrusion-tolerant protocol. Intrusion-tolerant protocols are cryptographic protocols that implement fault-tolerance techniques to achieve security despite possible intrusions at some parts of the system. Among the most tedious faults to handle in security are the so-called Byzantine faults, where insiders maliciously exhibit an arbitrary (possibly dishonest) behavi...

متن کامل

Formally Verified Byzantine Agreement in Presence of Link Faults

This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for bot...

متن کامل

The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model

Modern veriication systems such as PVS are now reaching the stage of development where the formal veriication of critical algorithms is feasible with reasonable eeort. This paper describes one such veriication in the eld of fault tolerance. The distribution of single-source data to replicated computing channels (Interactive Consistency or Byzantine Agreement) is a central problem in this eld. T...

متن کامل

A Formallv Verified Algorithm Synchrohation Under"a Hybri Model for Clock .d Fault a Formally Verified Algorithm for Clock Synchronization under a Hybrid Fault Model 1 Final Report for Sri Project 8200, Task 7

A small modification to the interactive convergence clock synchronization algorithm allows it to tolerate a larger number of simple faults than the standard algorithm, without reducing its ability to tolerate arbitrary or “Byzantine” faults. Because the extended case-analysis required by the new fault model complicates the already intricate argument for correctness of the algorithm, it has been...

متن کامل

Formal Specification and Verification of the Intrusion-Tolerant Enclaves Protocol

We demonstrate the application of formal methods to the verification of intrusion-tolerant agreement protocols that have a distributed leadership and can tolerate Byzantine faults. As an interesting case study, the Enclaves groupmembership protocol has been verified using two techniques: model checking and theorem proving. We use the model checker Murphi to prove the correctness of authenticati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001